Diffusion Approximation for Open State-Dependent Queueing Networks in the Heavy Traffic Situation
نویسندگان
چکیده
منابع مشابه
The Heavy-traffic Botrleneck Phenomenon in Open Queueing Networks
This note describes a simulation experiment involving nine exponential queues in series with a non-Poisson arrival process, which demonstrates that the heavy-traffic bottleneck phenomenon can occur in practice (at reasonable traffic intensities) as well as in theory (in the limit). The results reveal limitations in customary two-moment approximations for open queueing networks. queues * open qu...
متن کاملThe Heavy-traffic Bottleneck Phenomenon in Open Queueing Networks
This note describes a simulation experiment involving nine exponential queues in series with a non-Poisson arrival process, which demonstrates that the heavy-traffic bottleneck phenomenon can occur in practice (at reasonable traffic intensities) as well as in theory (in the limit). The results reveal limitations in customary two-moment approximations for open queueing networks.
متن کاملValidity of Heavy Traffic Steady-State Approximations in Open Queueing Networks
We consider a single class open queueing network, also known as a Generalized Jackson Network (GJN). A classical result in heavy traffic theory asserts that the sequence of normalized queue length processes of the GJN converge weakly to a Reflected Brownian Motion (RBM) in the orthant, as the traffic intensity approaches unity. However, barring simple instances, it is still not known whether th...
متن کاملHeavy Traffic Limits for Some Queueing Networks
Using a slight modification of the framework in Bramson [7] and Williams [52], we prove heavy traffic limit theorems for six families of multiclass queueing networks. The first three families are single station systems operating under first-in first-out (FIFO), generalized headof-the-line proportional processor sharing (GHLPPS) and static buffer priority (SBP) service disciplines. The next two ...
متن کاملA heavy traffic limit theorem for a class of open queueing networks with finite buffers
We consider a queueing network of d single server stations. Each station has a finite capacity waiting buffer, and all customers served at a station are homogeneous in terms of service requirements and routing. The routing is assumed to be deterministic and hence feedforward. A server stops working when the downstream buffer is full. We show that a properly normalized d-dimensional queue length...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1995
ISSN: 1050-5164
DOI: 10.1214/aoap/1177004602